Ela the External Vertices Conjecture in Case
نویسنده
چکیده
The determinantal conjecture of M. Marcus and G. N. de Oliveira is known in many special cases. The case of 3 × 3 matrices was settled by N. Bebiano, J. K. Merikoski and J. da Providência. The case n = 4 remains open. In this article a technical conjecture is established implying a weakened form of the determinantal conjecture for n = 4.
منابع مشابه
-λ coloring of graphs and Conjecture Δ ^ 2
For a given graph G, the square of G, denoted by G2, is a graph with the vertex set V(G) such that two vertices are adjacent if and only if the distance of these vertices in G is at most two. A graph G is called squared if there exists some graph H such that G= H2. A function f:V(G) {0,1,2…, k} is called a coloring of G if for every pair of vertices x,yV(G) with d(x,y)=1 we have |f(x)-f(y)|2 an...
متن کاملThe external vertices conjecture in case n=4
The determinantal conjecture of M. Marcus and G. N. de Oliveira is known in many special cases. The case of 3 × 3 matrices was settled by N. Bebiano, J. K. Merikoski and J. da Providência. The case n = 4 remains open. In this article a technical conjecture is established implying a weakened form of the determinantal conjecture for n = 4.
متن کاملTotal domination in $K_r$-covered graphs
The inflation $G_{I}$ of a graph $G$ with $n(G)$ vertices and $m(G)$ edges is obtained from $G$ by replacing every vertex of degree $d$ of $G$ by a clique, which is isomorph to the complete graph $K_{d}$, and each edge $(x_{i},x_{j})$ of $G$ is replaced by an edge $(u,v)$ in such a way that $uin X_{i}$, $vin X_{j}$, and two different edges of $G$ are replaced by non-adjacent edges of $G_{I}$. T...
متن کاملEla Graphs with Small Spectral Gap∗
It is conjectured that connected graphs with given number of vertices and minimum spectral gap (i.e., the difference between their two largest eigenvalues) are double kite graphs. The conjecture is confirmed for connected graphs with at most 10 vertices, and, using variable neighbourhood metaheuristic, there is evidence that it is true for graphs with at most 15 vertices. Several spectral prope...
متن کاملMore Constructions for Turan's (3, 4)-Conjecture
For Turán’s (3, 4)-conjecture, in the case of n = 3k +1 vertices, 1 2 6k−1 non-isomorphic hypergraphs are constructed that attain the conjecture. In the case of n = 3k + 2 vertices, 6k−1 non-isomorphic hypergraphs are constructed that attain the conjecture.
متن کامل